new lower bound meaning in Chinese
新下界
Examples
- Compare to existing results for general graph , new lower bound on the size of the minimum feedback vertex set of ( n , k ) - star graph is given based on its special structure
本文主要讨论了关于组合星图反馈结点集的下界问题，在基于组合星图的性质和已有相关结果的基础上，给出了组合星图反馈结点集的新的下界。 - For the non - preemptive version , we present a new lower bound 6 5 which improves the known lower bound 1 . 161 . for the preemptive version , we present an optimal semi - online algorithm with a competitive ratio of 1 in the case that the total size is not greater than 4 , and an algorithm with a competitive ratio of 5 4 otherwise , while a lower bound 1 . 0957 is also presented for general case
本文的主要结果为：对不可中断的情况，我们给出了该问题的下界是6 5 ，从而改进了文献中的给出的结果1 . 161 .对可中断的情况，所谓工件加工允许中断，即加工过程中允许机器暂停某工件的加工，而改为加工另一工件。 - First we give some notations : where r lti : the load of the machine at step t ( i . e . , immediately after the ith job has been scheduled ) optt : the current optimum makespan in step t ( for the job set { j1 ; … , jt } ) lbt : the lower bound of the length in step t for a set of jobs with processing times p1 , … , pn , there are three straightforward lower bounds for the makespan of any preemptive schedule on m identical machines : max so we have lb = max ( 3 . 2 . 1 ) the algorithm will schedule jobs in such a way that , at any step t algorithm : a new job jt + 1 ( which arrives at time t + 1 ) is assigned as follows : step 1 compute the new lower bound lbi + 1 according to ( 3 . 2 . 1 ) step 2 research the following reserved intervals
需加工n个工件人； … ；人，每个工件是在线到达（ oneb ， olle ）且可打断的，机器人人的准备时间为az ，怎样安排加工顺序，使工件的最大完工时间（ makespan ）尽可能地小，称此问题为带机器准备时间的平行机在线排序问题。它是带机器准备时间的平行机排序和平行机在线排序问题的综合和推广；具有广泛的应用背景。这里工件在线到达（ onebyone ）指的是工件的情况并不是提前知道的，只有将工件jj人安排完以后我们才能知道工jj的一些情况p工件的加工时间p 。